An implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem
نویسنده
چکیده
In this paper we present an implementation of a generic memetic algorithm for the edge bi connectivity augmentation problem the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge bi connected This problem is known for its applications to communication network de sign the extension of an existing communication network to become robust against single link failures as well as in VLSI oor planning We provide a C implementation of a generic memetic algorithm for the problem as a good alternative for approximately solving it We use known benchmarks in the literature for the problem as to ex perimentally evaluate how good the generic memetic algorithm works
منابع مشابه
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes an effective preprocessing of problem data and a fast ...
متن کاملA Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-biconnectivity augmentation (E2AUG) problem, in which a given graph G0(V, E0) needs to be augmented by the cheapest possible set of edges AUG so that a single edge deletion does not disconnect G0. The new approach is bas...
متن کاملRange Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimu...
متن کاملA redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملA Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs
This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes effective preprocessing of problem data and a fast loc...
متن کامل